Optimal Coverage Multi-Path Scheduling Scheme with Multiple Mobile Sinks for WSNs
نویسندگان
چکیده
منابع مشابه
Efficient Data Collection with path Constrained Mobile sinks using Shortest Path Member Assignment Scheme in WSNs
A crucial issue for data collection in wireless sensor networks is that the energy consumption of the sensor nodes placed near the sink is very high. This is because the sensors placed near the sink have to forward the data to the sink on behalf of others resulting in the depletion of energy quickly, which will lead to network partitioning and limitation in the network lifetime. In order to sol...
متن کاملTowards an Optimal Positioning of Multiple Mobile Sinks in WSNs for Buildings
The need for wireless sensor networks is rapidly growing in a wide range of applications specially for buildings automation. In such networks, a large number of sensors with limited energy supply are in charge of relaying the sensed data hop by hop to the nearest sink. The sensors closest to the sinks deplete their energy much faster than distant nodes because they carry heavy traffic which cau...
متن کاملA Hybrid Adaptive Protocol for Reliable Data Delivery in WSNs with Multiple Mobile Sinks
In this paper we deal with reliable and energy-efficient data delivery in sparse Wireless Sensor Networks with multiple Mobile Sinks (MSs). This is a critical task, especially when MSs move randomly, as interactions with sensor nodes are unpredictable, typically of short duration, and affected by message losses. In addition, multiple MSs can be simultaneously present in the sensor contact area ...
متن کاملPerformance Analysis for Efficient Data Collection with path Constrained Mobile sink Using SPMA Scheme in WSNs
A crucial issue for data collection in wireless sensor networks is that the energy consumption of the sensor nodes placed near the sink is very high. This is because the sensors placed near the sink have to forward the data to the sink on behalf of others resulting in the depletion of energy quickly, which will lead to network partitioning and limitation in the network lifetime. In order to sol...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, Materials & Continua
سال: 2020
ISSN: 1546-2226
DOI: 10.32604/cmc.2020.08674